#include"BinaryTree.h"
#include "Queue.h"
BTNode* BuyNode(int val)
{
	BTNode* node = (BTNode*)malloc(sizeof(BTNode));
	node->right = NULL;
	node->left = NULL;
	node->val = val;
	return node;
}
BTNode* CreatBinaryTree()
{
	BTNode* node1 = BuyNode(1);
	BTNode* node2 = BuyNode(2);
	BTNode* node3 = BuyNode(3);
	BTNode* node4 = BuyNode(4);
	BTNode* node5 = BuyNode(5);
	BTNode* node6 = BuyNode(6);

	node1->left = node2;
	node1->right = node4;
	node2->left = node3;
	node4->left = node5;
	node4->right = node6;
	return node1;
}

int main()
{
	BTNode* bt = CreatBinaryTree();
	PrevOrder(bt);
	printf("\n");
	InOrder(bt);
	printf("\n");
	PostOrder(bt);
	printf("\n");
	LevelOrderTraversal(bt);
	printf("%d\n",TreeLevelKSize(bt, 3));
	printf("%d ",BTSize(bt));
	printf("\n%d\n",TreeComplete(bt));
	return 0;
}